Flow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search

Authors

  • D. Rahmani,
  • M. Saidi-Mehrabad,
Abstract:

Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization problem. According to computational experiments on data sets, it is suggested that GA is a more appropriate method to solve this problem. GA can reach good-quality solutions in short computational time, and can be used to solve large scale problems effectively. Keywords: Flow Shop Scheduling, Missing Operation, Mixed-Binary Integer Programming, Genetic Algorithm, Tabu Search.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

MILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints

In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...

full text

An Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations

Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...

full text

Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling

This paper presents a new algorithm based on integrating Genetic Algorithms and Tabu Search methods to solve the Job Shop Scheduling problem. The idea of the proposed algorithm is derived from Genetic Algorithms. Most of the scheduling problems require either exponential time or space to generate an optimal answer. Job Shop scheduling (JSS) is the general scheduling problem and it is a NP-compl...

full text

A Tabu Genetic algorithm with Search Area Adaptation for the Job-Shop Scheduling Problem

The job-shop scheduling problem is the important issues to the research of optimal problems. Besides, tabu search is also applied to GA, called TGA for traveling salesman problem (TSP) that has better effectiveness than GA. Thus, this is an interest and important research area for job-shop scheduling problem with TGA. In this paper, we try to discuss this issue. According to the TGA, it maintai...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 1  issue None

pages  0- 0

publication date 2011-11

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023